%ما هو (من)٪ 1 - تعريف
PROCESS OF ASSIGNING A LARGE NUMBER OF TARGET PROGRAM VARIABLES ONTO A SMALL NUMBER OF CPU REGISTERS
Register spilling; Register spill; Global graph coloring register allocation; Register allocator; Live range; Register allocation by graph coloring; Spilling a register
register allocation
<compiler, algorithm> The phase of a compiler that
determines which values will be placed in registers.
Register allocation may be combined with {register
assignment}.
This problem can be shown to be isomorphic to {graph
colouring} by relating values to nodes in the graph and
registers to colours. Values (nodes) which must be valid
simultaneously are linked by edges and cannot be stored in the
same register (coloured the same).
See also register dancing and register spilling.
[Preston Briggs, PhD thesis, Rice University, April 1992
{"Register Allocation via Graph Coloring"
(ftp://ftp.cs.rice.edu/public/preston/thesis.ps.gz) }].
(2000-12-04)
Register allocation
In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.
register spilling
<programming, compiler> (By analogy with spilling the contents
of an overfull container) When a compiler is generating
machine code and there are more live variables than the
machine has registers and it has to transfer or "spill" some
variables from registers to memory.
(1997-06-24)
ويكيبيديا
Register allocation
In compiler optimization, register allocation is the process of assigning local automatic variables and expression results to a limited number of processor registers.
Register allocation can happen over a basic block (local register allocation), over a whole function/procedure (global register allocation), or across function boundaries traversed via call-graph (interprocedural register allocation). When done per function/procedure the calling convention may require insertion of save/restore around each call-site.
